The average complexity of a coin-weighing problem
نویسندگان
چکیده
Given a set of n coins, some of them weighing H, the others weighing h, h < H, we prove that to determine the set of heavy coins, an optimal algorithm requires an average of 1+ρ 1+ρ+ρ n + O(1) comparisons, using a beam balance, in which ρ denotes the ratio of the probabilities of being light and heavy. A simple quasi-optimal algorithm is described. Similar results are derived for the majority problem.
منابع مشابه
Lower Bounds on Two Coin-Weighing Problems, with Applications to Threshold Circuits
Among a set of n coins of two weights (good and bad), and using a balance, we wish to determine the number of bad coins using as few measurements as possible. There is a known adaptive decision tree that answers this question in O((log(n))) measurements, and a slight modification of this decision tree determines the parity of the number of bad coins in O(log n). In this paper, we prove an Ω( √ ...
متن کاملOptimal Algorithms for the Coin Weighing Problem with a Spring Scale
Suppose we are given n coins out of a collection of coins of two distinct weights w0 and w1, true and counterfeit coins, respectively, where d of them are counterfeit coins. Assume we are allowed to weigh subsets of coins in a spring scale. Determine the counterfeit coins in a minimal number of weighing. This problem is equivalent to the following learning problem: Given a linear function f = x...
متن کاملoptimal Detection of a Counterfeit Coin with Multi-arms Balances
We consider the problem of locating a light coin out of a set containing n coins, n ? 1 of which have the same weight. The weighing device is a balance with r 2 pans and, when r equally sized subset of coins are weighted, it indicates the eventual subset containing the light coin. We give an algorithm to nd the counterfeit coin that requires the minimum possible average number of weighings. All...
متن کاملAlgorithms for the Coin Weighing Problems with the Presence of Noise
The coin weighing problem is the following: Given n coins for which m of them are counterfeit with the same weight. The problem is to detect the counterfeit coins with minimal number of weighings. This problem has many applications in compressed sensing, multiple access adder channels, etc. This problem was solved when m is unknown. An old optimal non-adaptive polynomial time algorithm of Linds...
متن کاملQuantum Counterfeit Coin Problems
The counterfeit coin problem requires us to find all false coins from a given bunch of coins using a balance scale. We assume that the balance scale gives us only “balanced” or “tilted” information and that we know the number k of false coins in advance. The balance scale can be modeled by a certain type of oracle and its query complexity is a measure for the cost of weighing algorithms (the nu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Random Struct. Algorithms
دوره 9 شماره
صفحات -
تاریخ انتشار 1996